Longest fault-free paths in star graphs with vertex faults
نویسندگان
چکیده
The star graph Sn has been recognized as an attractive alternative to the hypercube. Since S1; S2, and S3 have trivial structures, we focus our attention on Sn with n¿4 in this paper. Let Fv denote the set of faulty vertices in Sn. We show that when |Fv|6n− 5; Sn with n¿6 contains a fault-free path of length n! − 2|Fv| − 2 (n! − 2|Fv| − 1) between arbitrary two vertices of even (odd) distance. Since Sn is bipartite with two partite sets of equal size, the path is longest for the worst-case scenario. The situation of n¿4 and |Fv|¿n − 5 is also discussed. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Fault-free longest paths in star networks with conditional link faults
The star network, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each node is assumed to be incident with two ormore fault-free links, we show that an n-dimensional star network can tolerate up to 2n− 7 link faults, and be strongly (fault-free)...
متن کاملFault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults
In this paper, we aim to embed a longest path between every two vertices of a star graph with at most n-3 random edge faults, where n is the dimension of the star graph. Since the star graph is regular of degree n1, n-3 (edge faults) is maximum in the worst case. We show that when n≥6 and there are n-3 edge faults, the star graph can embed a longest path between every two vertices, exclusive of...
متن کاملComputer Science Technical Report Combinatorial Analysis of Star Graph Networks
It is well known that star graphs are strongly resilient like the n cubes in the sense that they are optimally fault tolerant and the fault diameter is increased only by one in the presence of maximum number of allowable faults [Lat93b, RS93]. We investigate star graphs under the conditions of forbidden faulty sets [Esf89] where all the neighbors of any node cannot be faulty simultaneously; we ...
متن کاملLongest paths and cycles in faulty star graphs
In this paper, we investigate the star graph Sn with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of Sn, n ≥ 4, there is a fault-free path of length at least n!− 2fv − 1, and there is a path of length at least n!− 2fv − 2 joining a pair of vertices with the same color, when the number of fa...
متن کاملThe Embedding of Hamiltonian Paths in Faulty Arrangement Graphs
The arrangement graph, which represents a family of scalable graphs, is a generalization of the star graph. There are two parameters, denoted by n and k, for the arrangement graph, where 1 1 ≤ ≤ − k n . An n k , -arrangement graph, which is denoted by An,k, has vertices corresponding to the arrangements of k numbers out of the set 1 2 , , , n . In this thesis, a fault-free Hamiltonian path is e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 262 شماره
صفحات -
تاریخ انتشار 2001